Fast Parallel Space Allocation, Estimation and Integer Sorting
نویسندگان
چکیده
Fast Parallel Space Allocation, Estimation and Integer Sorting (revised) •
منابع مشابه
Set a bi-objective redundancy allocation model to optimize the reliability and cost of the Series-parallel systems using NSGA II problem
With the huge global and wide range of attention placed upon quality, promoting and optimize the reliability of the products during the design process has turned out to be a high priority. In this study, the researcher have adopted one of the existing models in the reliability science and propose a bi-objective model for redundancy allocation in the series-parallel systems in accordance with th...
متن کاملCONTENTS Foreword 4 Organization 5 Program 6 SESSION 1 - Paradigms and algorithms for CMPs
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number of cores is expected to rise further, this bottleneck will become more critical in the coming years. Hence, memory-efficient algorithms are required. As a case study, we investigate parallel sorting on Cell BE as a pro...
متن کاملA Memtic genetic algorithm for a redundancy allocation problem
Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...
متن کاملOptimal Parallel Approximation Algorithms for Prefix Sums and Integer Sorting (Extended Abstract)
Ragde. Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs. Optimal doubly logarithmic parallel algorithms based on nding all nearest smaller values. Optimal sub-logarithmic time integer sorting on a CRCW PRAM (note). Submitted for publication, 1991. 27] Sandeep Sen. Finding an approximate median with high probability in constant paralle...
متن کاملTheorem 4.2 given a Set S of N Planar Points with 4.2 Point Set Triangulation 3 Padded Integer Sorting Approximate Parallel Preex Computation and Its Applications (preliminary Version)
wards a theory of nearly constant time parallel algorithms. In FOCS '91, pages 698{710, Octo-ber 1991. 11] Michael T. Goodrich. Using approximation algorithms to design parallel algorithms that may ignore processor allocation. 18] Yossi Matias and Uzi Vishkin. Converting high probability into nearly-constant time|with applications to parallel hashing. In STOC '91, pages 307{316, 1991. 19] Sangu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 123 شماره
صفحات -
تاریخ انتشار 1995